Alternative axiomatizations of elementary probability theory
نویسنده
چکیده
1 Outline In this paper I offer some new axiomatizations of elementary (finite) probability theory. The new axiomatizations have the following distinctive features. First, both conditional and unconditional probabilities are simultaneously axiomatized. Second, the axiomatizations are extensions of Kolmogorov probability theory, and have the usual definitions linking conditional and unconditional probabilities as theorems. Third, while both probabilities are simultaneously axiomatized, the resultant axioms are about as simple as the usual axiomatizations of conditional probability alone. Fourth, the axioms adopted have strong and direct justifications independently of the interpretation of the probability function (axiomatization L however is only a permissible extension of intuitions). The reader who wishes to review the axiomatizations before their rationale can at this point go to section 5 (the main axiomatization is system KK).
منابع مشابه
Aristotle, Boole, and Categories
We propose new axiomatizations of the 24 assertoric syllogisms of Aristotle’s syllogistic, and the 2 n n-ary operations of Boole’s algebraic logic. The former organizes the syllogisms as a 6 × 4 table partitioned into four connected components according to which term if any must be inhabited. We give two natural-deduction style axiomatizations, one with four axioms and four rules, the second wi...
متن کاملLogical Theories for Fragments of Elementary Geometry
We survey models and theories of geometric structures of parallelism, orthogonality, incidence, betweenness and order, thus gradually building towards full elementary geometry of Euclidean spaces, in Tarski’s sense. Besides the geometric aspects of such structures we look at their logical (first-order and modal) theories and discuss logical issues such as: expressiveness and definability, axiom...
متن کاملAn Improved Lower Bound for the Elementary Theories of Trees
The rst-order theories of nite and rational, constructor and feature trees possess complete axiomatizations and are decidable By using the uniform inseparability lower bounds techniques due to Compton and Henson 6], based on representing large binary relations by means of short formulas manipulating with high trees, we prove that all the above theories, as well as all their subtheories, are non...
متن کاملOn the Finite Axiomatizability of ∀ Σ̂ b 1 ( R̂ 12 )
The question of whether the bounded arithmetic theories S 1 2 and R 2 are equal is closely connected to the complexity question of whether P is equal to NC. In this paper, we examine the still open question of whether the prenex version of R 2 , R̂ 1 2 , is equal to S 1 2 . We give new dependent choice-based axiomatizations of the ∀Σ̂1-consequences of S 1 2 and R̂ 2 . Our dependent choice axiomati...
متن کاملOn qualitative axiomatizations for probability theory
In the literature, there are many axiomatiaations of qualitative probability. They all suffer certain defects: either they are too nonspecific and allow nonunique quantitative interpretations or am overspecific and rule out cases with unique quantitative interpretations. In this paper, it is shown that the class of qualitative probability structures with nonunique quantitative interpretations i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 20 شماره
صفحات -
تاریخ انتشار 1979